Forward Secure Ring Signature without Random Oracles
نویسندگان
چکیده
In this paper, we propose a forward secure ring signature scheme without random oracles. With forward security, if a secret key of a corresponding ring member is exposed, all previously signed signatures containing this member remain valid. Yet the one who has stolen the secret key cannot produce any valid signature belonged to the past time period. This is especially useful in the case of ring signature, as the exposure of a single secret key may result in the invalidity of thousands or even millions ring signatures which contain that particular user. However, most of the ring signature schemes in the literature do not provide forward security. The only one with this feature [14] relies on random oracles to prove the security. We are the first to construct a forward secure ring signature scheme that can be proven secure without random oracles. Our scheme can be deployed in many applications, such as wireless sensor networks and smart grid system.
منابع مشابه
A provable secure anonymous proxy signature scheme without random oracles
In order to protect the proxy signers’ privacy, many anonymous proxy signature schemes which are also called proxy ring signatures, have been proposed. Although the provable security in the random oracle model has received a lot of criticism, there is no provable secure anonymous proxy signature scheme without random oracles. In this paper, we propose the first provable secure anonymous proxy s...
متن کاملFine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-secure signature schemes do but, in addition, allow the signer to specify which signatures of the current time period remain valid when revoking the public key. This is an important advantage if the signer produces man...
متن کاملEfficient Ring Signatures Without Random Oracles
We describe the first efficient ring signature scheme secure, without random oracles, basedon standard assumptions. Our ring signatures are based in bilinear groups. For l members ofa ring our signatures consist of 2l + 2 group elements and require 2l + 3 pairings to verify. Weprove our scheme secure in the strongest security model proposed by Bender, Katz, and Morselli:namely, ...
متن کاملn) without Random Oracles
Ring signatures, introduced by Rivest, Shamir and Tauman (ASIACRYPT 2001), allow to sign a message on behalf of a set of users (called a ring) while guaranteeing authenticity, i.e. only members of the ring can produce valid signatures, and anonymity, i.e. signatures hide the actual signer. In terms of efficiency, the shortest ring signatures are of size Θ(logn), where n is the size of the ring,...
متن کامل(Hierarchical Identity-Based) Threshold Ring Signatures without Random Oracles
We construct the first several efficient threshold ring signatures (TRS) without random oracles. Specializing to a threshold of one, they are the first several efficient ring signatures without random oracles after the only earlier instantiation of Chow, Liu, Wei, and Yuen [22]. Further specializing to a ring of just one user, they are the short (ordinary) signatures without random oracles summ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011